Superfast quenching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Superfast Line Spectral Estimation

A number of recent works have proposed to solve the line spectral estimation problem by applying off-the-grid extensions of sparse estimation techniques. These methods are preferable over classical line spectral estimation algorithms because they inherently estimate the model order. However, they all have computation times which grow at least cubically in the problem size, thus limiting their p...

متن کامل

Superfast laser cooling.

Currently, laser cooling schemes are fundamentally based on the weak coupling regime. This requirement sets the trap frequency as an upper bound to the cooling rate. In this work we present a numerical study that shows the feasibility of cooling in the strong-coupling regime which then allows cooling rates that are faster than the trap frequency with experimentally feasible parameters. The sche...

متن کامل

Nonlinear electrokinetics and "superfast" electrophoresis.

Nonlinear and nonequilibrium electrophoresis of spherical particles of radius a is shown to be possible when the solid surface allows field or current penetration. At low particle Peclet numbers, transient capacitative charging occurs until the surface polarization completely screens the external field. For a DC applied field [see text], the resulting electrokinetic velocity reaches Dukhin's ma...

متن کامل

Text Compression and Superfast Searching

In this paper, a new compression scheme for text is presented. The same is efficient in giving high compression ratios and enables super fast searching within the compressed text. Typical compression ratios of 70-80% and reducing the search time by 80-85% are the features of this paper. Till now, a trade-off between high ratios and searchability within compressed text has been seen. In this pap...

متن کامل

Superfast Algorithms for Singular Toeplitz-like Matrices

We apply the superfast divide-and-conquer MBA algorithm to possibly singular n × n Toeplitz-like integer input matrices and extend it to computations in the ring of integers modulo a power of a random prime. We choose the power which barely fits the size of a computer word; this saves word operations in the subsequent lifting steps. We extend our early techniques for avoiding degeneration while...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Equations

سال: 2004

ISSN: 0022-0396

DOI: 10.1016/j.jde.2003.11.001